MMIC technology for advanced space communications systems

The current NASA program for 20 and 30 GHz monolithic microwave integrated circuit (MMIC) technology is reviewed. The advantages of MMIC are discussed. Millimeter wavelength MMIC applications and technology for communications systems are discussed. Passive and active MMIC compatible components for millimeter wavelength applications are investigated. The cost of a millimeter wavelength MMIC's is projected

Single-Photon Counting Detector Scalability for High Photon Efficiency Optical Communications Links

For high photon-efficiency deep space or low power optical communications links, such as the Orion Artemis-2 Optical Communications System (O2O) project, the received optical signal is attenuated to the extent that single- photon detectors are required. For direct-detection receivers operating at 1.55 m wavelength, single-photon detectors including Geiger-mode InGaAs avalanche photon diodes (APDs), and in particular superconducting nanowire single-photon detectors (SNSPDs) offer the highest sensitivity and fastest detection speeds. However, these photon detectors exhibit a recovery time between registered input pulses, effectively reducing the detection efficiency over the recovery interval, resulting in missed photon detections, reduced count rate, and ultimately limiting the achievable data rate. A method to overcome this limitation is to divide the received optical signal into multiple detectors in parallel. Here we analyze this approach for a receiver designed to receive a high photon efficiency serially concatenated pulse position modulation (SCPPM) input waveform. From measured count rate and efficiency data using commercial SNSPDs, we apply a model from which we determine the effective detection efficiency, or blocking loss, for different input signal rates. We analyze the scalability of adding detectors in parallel for different modulation orders and background levels to achieve desired data rates. Finally we show tradeoffs between the number of detectors and the required received optical power, useful for real link design considerations

Detector Channel Combining Results from a High Photon Efficiency Optical Communications Link Test Bed

The National Aeronautics and Space Administration (NASA) Glenn Research Center (GRC) is developing a low cost, scalable, photon-counting receiver prototype for space-to-ground optical communications links. The receiver is being tested in a test bed that emulates photon-starved space-to-ground optical communication links. The receiver uses an array of single-pixel fiber-coupled superconducting nanowire single-photon detectors. The receiver is designed to receive the high photon efficiency serially concatenated pulse position modulation (SCPPM) waveform specified in the Consultative Committee for Space Data Systems (CCSDS) Optical Communications Coding and Synchronization Blue Book Standard. The optical receiver consists of an array of single-pixel superconducting nanowire detectors, analog phase shifters for channel alignment, digitizers for each detector channel, and digital processing of the received signal. An overview of the test bed and arrayed receiver system is given. Simulation and system characterization results are presented. The data rate increase of using a four-channel arrayed detector system over using one single pixel nanowire detector is characterized. Results indicate that a single-pixel detector is capable of receiving data at a rate of 40 Mbps and a four-channel arrayed detector system is capable of receiving data at a rate of 130 Mbps

Parameterized Algorithms for Graph Partitioning Problems

We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\subseteq V$ of size $k$, such that $\alpha_1m_1 + \alpha_2m_2$ is at most (or at least) $p$, where $\alpha_1,\alpha_2\in\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $k$-Sparsest Subgraph. Our main result is an $O^*(4^{k+o(k)}\Delta^k)$ algorithm for any problem in this class, where $\Delta \geq 1$ is the maximum degree in the input graph. This resolves an open question posed by Bonnet et al. [IPEC 2013]. We obtain faster algorithms for certain subclasses of FGPPs, parameterized by $p$, or by $(k+p)$. In particular, we give an $O^*(4^{p+o(p)})$ time algorithm for Max $(k,n-k)$-Cut, thus improving significantly the best known $O^*(p^p)$ time algorithm

Microwave monolithic integrated circuit development for future spaceborne phased array antennas

The development of fully monolithic gallium arsenide (GaAs) receive and transmit modules suitable for phased array antenna applications in the 30/20 gigahertz bands is presented. Specifications and various design approaches to achieve the design goals are described. Initial design and performance of submodules and associated active and passive components are presented. A tradeoff study summary is presented highlighting the advantages of distributed amplifier approach compared to the conventional single power source designs

Monolithic microwave integrated circuits: Interconnections and packaging considerations

Monolithic microwave integrated circuits (MMIC's) above 18 GHz were developed because of important potential system benefits in cost reliability, reproducibility, and control of circuit parameters. The importance of interconnection and packaging techniques that do not compromise these MMIC virtues is emphasized. Currently available microwave transmission media are evaluated to determine their suitability for MMIC interconnections. An antipodal finline type of microstrip waveguide transition's performance is presented. Packaging requirements for MMIC's are discussed for thermal, mechanical, and electrical parameters for optimum desired performance

Real Time Optical Receiver Project

The goals for the Real Time Optical Receiver project are to Infuse Consultative Committee for Space Data Systems High Photon Efficiency standard into missions, such as Artemis and to provide a real time ground receiver solution (fiber device, detector, real time FPGA-based receiver) that is: (1) Scalable: data rate, atmosphere conditions, telescope aperture, etc., and (2) Uses COTS components when available and work with companies to move custom parts to COTS

Gerry Downey: an authentic spectroscopist

This year has seen the retirement of Gerry Downey from active service with the Irish National Agriculture and Food Research Institute, Teagasc1 in Dublin. As one of Europe’s leading innovative spectroscopic chemometricians and a great positive personality to have as a project partner, we thought it appropriate to dedicate a column to Gerry’s career, however embarrassed he may be about the idea

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic

In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parametrisations with respect to the central decision problems. The model checking problem (MC) of PDL is NP-complete. The subject of this research is to identify a list of parametrisations (formula-size, treewidth, treedepth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) showing a different picture: under team-size, or dep-arity SAT is paraNP-complete whereas under all other mentioned parameters the problem is in FPT. Finally, we introduce a variant of the satisfiability problem, asking for teams of a given size, and show for this problem an almost complete picture.Comment: Update includes refined result